A New Approach for Vertex Guarding of Planar Graphs
نویسندگان
چکیده
منابع مشابه
A New Approach for Vertex Guarding of Planar Graphs
Making decisions about optimal or near optimal solutions arise daily. In many cases, the fact that an optimisation problem is being solved is sometimes not even obvious. The reason for that is, that such problems aremostly simple and small. On the other hand,more complex optimisation problems with huge input data arise that need to be solved efficiently. Luckily, in some cases their solution pr...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولVertex Degrees in Planar Graphs
For a planar graph on n vertices we determine the maximum values for the following: 1) the sum of the m largest vertex degrees. 2) the number of vertices of degree at least k. 3) the sum of the degrees of vertices with degree at least k.
متن کاملFast Vertex Guarding for Polygons
For a polygon P with n vertices, the vertex guarding problem asks for the minimum subset G of P ’s vertices such that every point in P is seen by at least one point in G. This problem is NP-complete and APX-hard. The first approximation algorithm (Ghosh, 1987) involves decomposing P into O ( n ) cells that are equivalence classes for visibility from the vertices of P . This discretized problem ...
متن کاملRefined Vertex Sparsifiers of Planar Graphs
We study the following version of cut sparsification. Given a large edge-weighted network G with k terminal vertices, compress it into a small network H with the same terminals, such that the minimum cut in H between every bipartition of the terminals approximates the corresponding one in G within factor q ≥ 1, called the quality. We provide two new insights about the structure of cut sparsifie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2002
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.2002.03.06